BU CAPACITA

Optimal Bu er Sharing

We address the problem of designing optimal bu er management policies in shared memory switches when packets already accepted in the switch can be dropped pushed out Our goal is to maximize the overall throughput or equivalently to minimize the overall loss probability in the system For a system with two output ports we prove that the optimal policy is of push out with threshold type POT The sa...

CMR March 18 BU

Natural Family Planning ............................. 1 The Menstrual Cycle .................................. 4 Male Fertility ................................................ 6 Contraceptives ........................................... 9 Under the Microscope Staging the Menopausal Transition: TREMIN and STRAW.................................. 13 Of Interest ......................................

CMR March 18 BU

(Continued on p. 2) Large European Data Base Indicates STM Effective Method of Family Planning Since 1984, German researchers from the University of Dusseldorf and the University of Heidelberg have been developing and analyzing a data set of menstrual cycles collected from multiple European sites. This long-term menstrual cycle data base (of 32,788 prospectively collected menstrual cycles) was ...

CMR March 18 BU

TCP - BFA : Bu er Fill

The main goal of a congestion avoidance algorithm is to maximize throughput and minimize delay (Jain & Ramakrishnan 1988). While TCP Reno achieves high throughput, it tends to consume all of the buuer space at the bottleneck router, causing large delays. In this paper we propose a simple scheme that modiies TCP Reno's congestion avoidance algorithm by throttling back the opening of the congesti...